PRIMAL-DUAL GENETIC ALGORITHMS FOR ROYAL ROAD FUNCTIONS
نویسندگان
چکیده
منابع مشابه
Genetic Algorithms Based on Primal-Dual Chromosomes for Royal Road Functions
Genetic algorithms (GAs) have been broadly studied by a huge amount of researchers and there are many variations developed based on Holland’s simple genetic algorithm (SGA). Inspired by the idea of diploid genotype and dominance mechanisms that broadly exists in nature, we propose a primal-dual genetic algorithm (PDGA). PDGA operates on a pair of chromosomes that are primal-dual to each other i...
متن کاملPrimal-dual path-following algorithms for circular programming
Circular programming problems are a new class of convex optimization problems that include second-order cone programming problems as a special case. Alizadeh and Goldfarb [Math. Program. Ser. A 95 (2003) 3-51] introduced primal-dual path-following algorithms for solving second-order cone programming problems. In this paper, we generalize their work by using the machinery of Euclidean Jordan alg...
متن کامل'Royal-Road' Landscapes for a Dual Genetic Algorithm
Genetic Algorithms may be viewed as an optimization method based on an Artificial Evolution which is at the center of most works in Artificial Life. Since they were introduced by J. Holland during the sixties, their weaknesses and effectiveness have been intensively studied in two ways; by designing “improved GA” such as the Dual Genetic Algorithms described later, or by studying features of fu...
متن کاملAdaptive Evolutionary Algorithms on Unitation, Royal Road and Longpath Functions
Genetic algorithms (GAs) are powerful tools that allow engineers and scientists to find good solutions to hard computational problems using evolutionary principles. The classic genetic algorithm suffers from the configuration problem, the difficulty of choosing optimal parameter settings. Genetic algorithm literature is full of empirical tricks, techniques, and rules of thumb that enable GAs to...
متن کاملMarkov Random Field Modelling of Royal Road Genetic Algorithms
Markov Random Fields (MRFs) [5] are a class of probabalistic models that have been applied for many years to the analysis of visual patterns or textures. In this paper, our objective is to establish MRFs as an interesting approach to modelling genetic algorithms. Our approach bears strong similarities to recent work on the Bayesian Optimisation Algorithm [9], but there are also some signi cant ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC Proceedings Volumes
سال: 2002
ISSN: 1474-6670
DOI: 10.3182/20020721-6-es-1901.00715